Efficient lower and upper bounds of the diagonal-flip distance between triangulations
نویسندگان
چکیده
There remains today an open problem whether the rotation distance between binary trees or equivalently the diagonal-flip distance between triangulations can be computed in polynomial time. We present an efficient algorithm for computing lower and upper bounds of this distance between a pair of triangulations. © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
Modular flip-graphs of one-holed surfaces
We study flip-graphs of triangulations on topological surfaces where distance is measured by counting the number of necessary flip operations between two triangulations. We focus on surfaces of positive genus g with a single boundary curve and n marked points on this curve; we consider triangulations up to homeomorphism with the marked points as their vertices. Our main results are upper and lo...
متن کاملBetter Approximation of Diagonal-Flip Transformation and Rotation Transformation
Approximation algorithms are developed for the diagonalflip transformation of convex polygon triangulations and equivalently rotation transformation of binary trees. For two arbitrary triangulations in which each vertex is an end of at most d diagonals, Algorithm A has the approximation ratio 2− 2 4(d−1)(d+6)+1 . For triangulations containing no internal triangles, Algorithm B has the approxima...
متن کاملUpper and lower bounds for numerical radii of block shifts
For an n-by-n complex matrix A in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of A. In this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...
متن کاملAn efficient upper bound of the rotation distance of binary trees
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons triangulations. Ordinal tools are used. 2000 Elsevier Science B.V. All rights reserved.
متن کاملFlipping edge-labelled triangulations
Flips in triangulations have received a lot of attention over the past decades. However, the problem of tracking where particular edges go during the flipping process has not been addressed. We examine this question by attaching unique labels to the triangulation edges. We introduce the concept of the orbit of an edge e, which is the set of all edges reachable from e via flips. We establish the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 100 شماره
صفحات -
تاریخ انتشار 2006